EM Algorithm for Symmetric Causal Independence Models
نویسندگان
چکیده
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this paper, we present the EM algorithm to learn the parameters in causal independence models based on the symmetric Boolean function. The developed algorithm enables us to assess the practical usefulness of the symmetric causal independence models, which has not been done previously. We evaluate the classification performance of the symmetric causal independence models learned with the presented EM algorithm. The results show the competitive performance of these models in comparison to noisy OR and noisy AND models as well as other state-of-the-art classifiers.
منابع مشابه
Symmetric Causal Independence Models for Classification
Causal independence modelling is a well-known method both for reducing the size of probability tables and for explaining the underlying mechanisms in Bayesian networks. In this paper, we propose an application of an extended class of causal independence models, causal independence models based on the symmetric Boolean function, for classification. We present an EM algorithm to learn the paramet...
متن کاملPrague , Czech Republic September 12 − 15 , 2006 Probabilistic Graphical Models
ion and Refinement for Solving Continuous Markov Decision Processes. . . . . . . . . . . . . . .263Alberto Reyes, Pablo Ibargüengoytia, L. Enrique Sucar, and Eduardo Morales Bayesian Model Averaging of TAN Models for Clustering. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .271Guzmán Santafé, Jose A. Lozano, and Pedro Larrañaga Dynamic Weighting A* Search-based ...
متن کاملIntegrating Locally Learned Causal Structures with Overlapping Variables
In many domains, data are distributed among datasets that share only some variables; other recorded variables may occur in only one dataset. While there are asymptotically correct, informative algorithms for discovering causal relationships from a single dataset, even with missing values and hidden variables, there have been no such reliable procedures for distributed data with overlapping vari...
متن کاملStructure and Parameter Learning for Causal Independence and Causal Interaction Models
We begin by discussing causal independence models and generalize these models to causal interaction models Causal interaction mod els are models that have independent mech anisms where mechanisms can have several causes In addition to introducing several particular types of causal interaction mod els we show how we can apply the Bayesian approach to learning causal interaction mod els obtaining...
متن کاملDiscovery of Causal Models that Contain Latent Variables Through Bayesian Scoring of Independence Constraints
Discovering causal structure from observational data in the presence of latent variables remains an active research area. Constraint-based causal discovery algorithms are relatively efficient at discovering such causal models from data using independence tests. Typically, however, they derive and output only one such model. In contrast, Bayesian methods can generate and probabilistically score ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006